We divide both by their common divisor . 用它们的公因子去除两个数。
2.
A pure c project that demonstrates euclid s algorithm for finding the greatest common divisor 纯c项目，它说明用于查找最大公约数的欧几里得算法。
3.
The euclidstep1 sample is a pure c project that demonstrates euclid s algorithm for finding the greatest common divisor Euclidstep1示例是一个纯c项目，它演示了用于查找最大公约数的euclid算法。
